An efficient parallel algorithm for O(N2) direct summation method and its variations on distributed-memory parallel machines
نویسندگان
چکیده
منابع مشابه
An efficient parallel algorithm for O(N) direct summation method and its variations on distributed-memory parallel machines
We present a novel, highly efficient algorithm to parallelize O(N)direct summation method for N -body problems with individual timesteps on distributed-memory parallel machines such as Beowulf clusters. Previously known algorithms, in which all processors have complete copies of the N -body system, has the serious problem that the communication-computation ratio increases as we increase the num...
متن کاملA Parallel Algorithm for Connected Components on Distributed Memory Machines
Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distribute...
متن کاملParallel Algorithms for Linear Approximation on Distributed Memory Machines
(Summary of Results) Abstract In this paper, we summarize our results in paralleliz-ing the linear approximation step on current distributed memory machines. We rst analyze the features of current distributed memory machines and the problem characteristics to understand the overheads in parallel solutions to the problem. Based on these, we propose an asynchronous algorithm which enhances proces...
متن کاملAn Efficient Parallel Sorting Algorithm for Multicore Machines
Sorting an array of integers is one of the most basic problems in Computer Science. Also it is an issue in high performance database applications. Though literature is imbued with a variety of sorting algorithms, different architectures need different optimizations to reduce sorting time. This paper presents a Multicore ready parallel sorting algorithm which has been designed with Multicore/Man...
متن کاملAn Efficient Parallel and Distributed Algorithm for Counting Frequent Sets
Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, which in many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm for counting the occurrence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Astronomy
سال: 2002
ISSN: 1384-1076
DOI: 10.1016/s1384-1076(02)00143-4